Memetic Algorithm to Optimize Preventive Maintenance Schedule for a Multi-Component Machine

نویسندگان

  • KARTIKEYA UPASANI
  • MIROOJIN BAKSHI
  • VIBHOR PANDHARE
  • Kartikeya Upasani
  • Miroojin Bakshi
  • Vibhor Pandhare
  • Bhupesh Kumar Lad
چکیده

Failure of a machine in a manufacturing industry leads to disruption of operations that severely impacts the enterprise in terms of revenue and customer satisfaction. The most prevalent strategy to mitigate the chance of machine failure is to perform preventive maintenance. Optimizing the preventive maintenance schedule is important to minimize operations cost and machine downtime. Further, for a multicomponent machine, the knowledge of which components to perform preventive maintenance on can be crucial for such optimization. A stochastic simulation model can be used to evaluate all possible candidates and find the optimum preventive maintenance schedule. However, this involves infeasible computational time owing to the combinatorial nature of the problem. A Memetic Algorithm is proposed as a heuristic in the present work to address this challenge. Accuracy of obtained solutions and run-time is compared with brute-force search method and genetic algorithm for the same system. The Memetic Algorithm is found to yield better results as it can explore the search space more efficiently.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints

This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regardi...

متن کامل

A New Mathematical Model for a Multi-product Supply Chain Network with a Preventive Maintenance Policy

The supply chain network design (SCND) implicates decision-making at a strategic level and makes it possible to create an effective and helpful context for managing. The aim of the network is to minimize the total cost so that customer's demands should be met. Preventive maintenance is pre-determined work performed to a schedule with the aim of preventing the wear and tear or sudden failure of ...

متن کامل

An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine

In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...

متن کامل

JIT single machine scheduling problem with periodic preventive maintenance

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...

متن کامل

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016